On this page you can get a detailed analysis of a word or phrase, produced by the best artificial intelligence technology to date:
['dʒibit]
существительное
['dʒibit]
общая лексика
виселица
повешение
техника
укосина
стрела (крана)
укосина, стрела крана
глагол
общая лексика
вешать
казнить
оставлять на виселице повешенных для устрашения
выставлять на позор
на посмешище
выставлять на позор, на посмешище
Смотрите также
In probability theory, Markov's inequality gives an upper bound for the probability that a non-negative function of a random variable is greater than or equal to some positive constant. It is named after the Russian mathematician Andrey Markov, although it appeared earlier in the work of Pafnuty Chebyshev (Markov's teacher), and many sources, especially in analysis, refer to it as Chebyshev's inequality (sometimes, calling it the first Chebyshev inequality, while referring to Chebyshev's inequality as the second Chebyshev inequality) or Bienaymé's inequality.
Markov's inequality (and other similar inequalities) relate probabilities to expectations, and provide (frequently loose but still useful) bounds for the cumulative distribution function of a random variable.